Row-ordering schemes for sparse givens transformations. I. bipartite graph model

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generic Graph Algorithms for Sparse Matrix Ordering

Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical framework, for reasons of performance the corresponding implementations are typically realized with programming languages devoid of language features necessary to explicitly represent graph abstractions. Recently, generic ...

متن کامل

Integrators Based on Householder and Givens Transformations

We carry further our work [DV2] on orthonormal integrators based on Householder and Givens transformations. We propose new algorithms and pay particular attention to appropriate implementation of these techniques. We also present a suite of Fortran codes and provide numerical testing to show the efficiency and accuracy of our techniques. AMS(MOS) subject classifications. Primary 65L

متن کامل

on bipartite divisor graph for character degrees

‎the concept of the bipartite divisor graph for integer subsets has been considered in [‎m‎. ‎a‎. ‎iranmanesh and c‎. ‎e‎. ‎praeger‎, ‎bipartite divisor graphs for integer subsets‎, ‎{em graphs combin.}‎, ‎{bf 26} (2010) 95--105‎.]‎. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g...

متن کامل

on bipartite divisor graph for character degrees

the concept of the bipartite divisor graph for integer subsets has been considered in [‎graph combinator., ‎ 26 (2010) 95--105‎.]. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g$ is a solvable group‎, ‎then the number of connected components of this graph is at most $2$ and if $g...

متن کامل

What Algebraic Graph Transformations Can Do For Model Transformations

Model transformations are key activities in model-driven development (MDD). A number of model transformation approaches have emerged for different purposes and with different backgrounds. This paper focusses on the use of algebraic graph transformation concepts to specify and verify model transformations in MDD.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1984

ISSN: 0024-3795

DOI: 10.1016/0024-3795(84)90022-3